Finding Minimum Spanning Trees in O(m (m;n)) Time
نویسنده
چکیده
We describe a deterministic minimum spanning tree algorithm running in time O(m (m; n)), where is a natural inverse of Ackermann's function and m and n are the number of edges and vertices, respectively. This improves upon the O(m (m; n) log (m; n)) bound established by Chazelle in 1997. A similar O(m (m; n))-time algorithm was discovered independently by Chazelle, predating the algorithm presented here by many months. This paper may still be of interest for its alternative exposition.
منابع مشابه
Reliability Evaluation of the Minimum Spanning Tree on Uncertain Graph
Minimum spanning tree is a minimum-cost spanning tree connecting the whole network, but it couldn't be directly obtained on uncertain graph. In this paper, we define the reliability as the existence probability of all minimum spanning trees and present an algorithm for evaluating reliability of the minimum spanning tree on uncertain graph. The time complexity of the algorithm is O(Nmn), where n...
متن کاملCounting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملRepresenting all Minimum Spanning Trees with Applications to Counting and Generation
We show that for any edge-weighted graph G there is an equivalent graph EG such that the minimum spanning trees of G correspond one-for-one with the spanning trees of EG. The equivalent graph can be constructed in time O(m + n log n) given a single minimum spanning tree of G. As a consequence we can count the minimum spanning trees of G in time O(m+ n), generate a random minimum spanning tree i...
متن کاملFinding the k Most Vital Edges with Respect to Minimum Spanning Trees for k=2 and 3
Let G(V,E) be a weighted, undirected, connected simple graph with n vertices and m edges. The k most vital edge problem with respect to minimum spanning trees is to find a set S of k edges from E such that the removal of all edges in S results in the greatest increase in the weight of the minimum spanning tree in the remaining graph G(V,E−S). In this paper we present a better algorithm to solve...
متن کاملListing all the minimum spanning trees in an undirected graph
Efficient polynomial time algorithms are well known for the minimum spanning tree problem. However, given an undirected graph with integer edge weights, minimum spanning trees may not be unique. In this article, we present an algorithm that lists all the minimum spanning trees included in the graph. The computational complexity of the algorithm is O(N(mn+ n2 log n)) in time and O(m) in space, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999